Formally self-dual additive codes over F4
نویسندگان
چکیده
We introduce a class of formally self-dual additive codes over F4 as a natural analogue of binary formally self-dual codes, which is missing in the study of additive codes over F4. We define extremal formally self-dual additive codes over F4 and classify all such codes. Interestingly, we find exactly three formally self-dual additive (7, 27) odd codes over F4 with minimum distance d = 4, a better minimum distance than any selfdual additive (7, 27) codes over F4. We further define near-extremal formally self-dual additive codes over F4 as an analogue of near-extremal binary formally self-dual codes and prove that they do not exist if their lengths are n = 16, 18 or n ≥ 20.
منابع مشابه
Formally self-dual additive codes over F4 and near-extremal self-dual codes
We introduce a class of formally self-dual additive codes over F4 as a natural analogue of binary formally self-dual codes, which is missing in the study of additive codes over F4. We define extremal formally self-dual additive codes over F4 and classify all such codes. Interestingly, we find exactly three formally self-dual additive (7, 27) odd codes over F4 with minimum distance d = 4, a bett...
متن کاملThe nonexistence of near-extremal formally self-dual codes
A code C is called formally self-dual if C and C⊥ have the same weight enumerators. There are four types of nontrivial divisible formally self-dual codes over F2, F3, and F4. These codes are called extremal if their minimum distances achieve the MallowsSloane bound. S. Zhang gave possible lengths for which extremal self-dual codes do not exist. In this paper, we define near-extremal formally se...
متن کاملGraph-based classification of self-dual additive codes over finite fields
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operation correspond to equivalence classes of codes. We have previously used this fact to classify self-dual additive codes over F4. In this paper we classify selfdual additive codes over ...
متن کاملCodes over F4, Jacobi forms and Hilbert-Siegel modular forms over Q(sqrt(5))
We study codes over a finite field F4. We relate self-dual codes over F4 to real 5-modular lattices and to self-dual codes over F2 via a Gray map. We construct Jacobi forms over Q( √ 5) from the complete weight enumerators of self-dual codes over F4. Furthermore, we relate Hilbert–Siegel forms to the joint weight enumerators of self-dual codes over F4. © 2004 Elsevier Ltd. All rights reserved.
متن کاملDirected graph representation of half-rate additive codes over GF(4)
Abstract. We show that (n, 2n) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation reduces the complexity of code classification, and enables us to classify additive (n, 2n) codes over GF(4) of length up to 7. From this we also derive classifications ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 45 شماره
صفحات -
تاریخ انتشار 2010